Iterative Dialogues and Automated Proof

نویسندگان

  • Konrad Slind
  • Richard Boulton
چکیده

In previous work Boulton et al., 1998], we have built a proof system that joins an interactive tactic-based theorem prover for a classical logic Gordon and Melham, 1993] with a fully automatic proof planner for a constructive logic Bundy et al., 1990]. This combined system signiicantly improves the automation of the interactive prover, but is unsatisfactory for several reasons. To overcome these drawbacks, we propose a general scheme whereby the combined system can pass through multiple rounds of interaction in searching for a proof. This scheme has been implemented and ooers an important increase in the power and usability of the combined system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dialogues for proof search

Dialogue games are a two-player semantics for a variety of logics, including intuitionistic and classical logic. Dialogues can be viewed as a kind of analytic calculus not unlike tableaux. Can dialogue games be an effective foundation for proof search in intuitionistic logic (both first-order and propositional)? We announce Kuno, an automated theorem prover for intuitionistic first-order logic ...

متن کامل

MacKE: Yet Another Proof Assistant & Automated Pedagogic Tool

In this paper, we describe the implementation of (yet another) proof assistant and/or automated pedagogic tool. This one is based on the calculus KE and our Prolog implementation of free variable KE. The new system is written in LPA MacProlog TM , and features an interactive interface via menus, dialogues and graphics tools, a graphics window for constructing and displaying proofs, and on-and o...

متن کامل

Argumentation Schemes and Burden of Proof

This paper analyzes the phenomenon of a shift of the burden of proof in persuasion dialogues in which arguments are constructed according to argumentation schemes. Some sample dialogues are analyzed with arguments from expert opinion, revealing that some critical questions of this scheme carry with them a burden of proof on the questioner while others do not, and that the burden of proof can be...

متن کامل

Image flip CAPTCHA

The massive and automated access to Web resources through robots has made it essential for Web service providers to make some conclusion about whether the "user" is a human or a robot. A Human Interaction Proof (HIP) like Completely Automated Public Turing test to tell Computers and Humans Apart (CAPTCHA) offers a way to make such a distinction. CAPTCHA is a reverse Turing test used by Web serv...

متن کامل

Incremental Closure of Free Variable Tableaux

This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures using free variable tableaux require iterative deepening and backtracking over applied instantiations to guarantee completeness. If the correct instantiation is hard to find, this can lead to a significant amount of duplicated wor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998